TSTP Solution File: SET753^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET753^4 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:08:18 EDT 2024
% Result : Theorem 0.23s 0.40s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET753^4 : TPTP v8.1.2. Released v3.6.0.
% 0.08/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.37 % Computer : n023.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 16:58:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.x2H349LPZo/Vampire---4.8_26174
% 0.15/0.39 % (26283)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.39 % (26287)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.39 % (26286)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (26285)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (26282)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.39 % (26288)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.39 % (26284)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.39 % (26286)Instruction limit reached!
% 0.15/0.39 % (26286)------------------------------
% 0.15/0.39 % (26286)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26286)Termination reason: Unknown
% 0.15/0.39 % (26286)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (26286)Memory used [KB]: 1023
% 0.15/0.39 % (26286)Time elapsed: 0.002 s
% 0.15/0.39 % (26286)Instructions burned: 2 (million)
% 0.15/0.39 % (26286)------------------------------
% 0.15/0.39 % (26286)------------------------------
% 0.15/0.39 % (26283)Instruction limit reached!
% 0.15/0.39 % (26283)------------------------------
% 0.15/0.39 % (26283)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26283)Termination reason: Unknown
% 0.15/0.39 % (26283)Termination phase: Preprocessing 2
% 0.15/0.39
% 0.15/0.39 % (26283)Memory used [KB]: 1023
% 0.15/0.39 % (26283)Time elapsed: 0.004 s
% 0.15/0.39 % (26283)Instructions burned: 4 (million)
% 0.15/0.39 % (26283)------------------------------
% 0.15/0.39 % (26283)------------------------------
% 0.15/0.39 % (26285)Instruction limit reached!
% 0.15/0.39 % (26285)------------------------------
% 0.15/0.39 % (26285)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26285)Termination reason: Unknown
% 0.15/0.39 % (26285)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (26285)Memory used [KB]: 1023
% 0.15/0.39 % (26285)Time elapsed: 0.003 s
% 0.15/0.39 % (26285)Instructions burned: 3 (million)
% 0.15/0.39 % (26285)------------------------------
% 0.15/0.39 % (26285)------------------------------
% 0.15/0.39 % (26289)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.39 % (26287)First to succeed.
% 0.15/0.39 % (26289)Instruction limit reached!
% 0.15/0.39 % (26289)------------------------------
% 0.15/0.39 % (26289)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26289)Termination reason: Unknown
% 0.15/0.39 % (26289)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (26289)Memory used [KB]: 1023
% 0.15/0.39 % (26289)Time elapsed: 0.003 s
% 0.15/0.39 % (26289)Instructions burned: 3 (million)
% 0.15/0.39 % (26289)------------------------------
% 0.15/0.39 % (26289)------------------------------
% 0.15/0.40 % (26288)Also succeeded, but the first one will report.
% 0.15/0.40 % (26282)Also succeeded, but the first one will report.
% 0.23/0.40 % (26287)Refutation found. Thanks to Tanya!
% 0.23/0.40 % SZS status Theorem for Vampire---4
% 0.23/0.40 % SZS output start Proof for Vampire---4
% 0.23/0.40 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.23/0.40 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.23/0.40 thf(func_def_3, type, emptyset: $i > $o).
% 0.23/0.40 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.23/0.40 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.23/0.40 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.23/0.40 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.23/0.40 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.23/0.40 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.23/0.40 thf(func_def_15, type, fun_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_16, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
% 0.23/0.40 thf(func_def_17, type, fun_inv_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.23/0.40 thf(func_def_18, type, fun_injective: ($i > $i) > $o).
% 0.23/0.40 thf(func_def_19, type, fun_surjective: ($i > $i) > $o).
% 0.23/0.40 thf(func_def_20, type, fun_bijective: ($i > $i) > $o).
% 0.23/0.40 thf(func_def_21, type, fun_decreasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.23/0.40 thf(func_def_22, type, fun_increasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.23/0.40 thf(func_def_37, type, sK0: $i > $i).
% 0.23/0.40 thf(func_def_38, type, sK1: $i > $o).
% 0.23/0.40 thf(func_def_39, type, sK2: $i > $o).
% 0.23/0.40 thf(f122,plain,(
% 0.23/0.40 $false),
% 0.23/0.40 inference(avatar_sat_refutation,[],[f105,f113,f121])).
% 0.23/0.40 thf(f121,plain,(
% 0.23/0.40 ~spl3_1),
% 0.23/0.40 inference(avatar_contradiction_clause,[],[f120])).
% 0.23/0.40 thf(f120,plain,(
% 0.23/0.40 $false | ~spl3_1),
% 0.23/0.40 inference(subsumption_resolution,[],[f116,f89])).
% 0.23/0.40 thf(f89,plain,(
% 0.23/0.40 (sK4 = (sK0 @ sK5))),
% 0.23/0.40 inference(equality_proxy_clausification,[],[f85])).
% 0.23/0.40 thf(f85,plain,(
% 0.23/0.40 ($true = ((sK0 @ sK5) = sK4))),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f84])).
% 0.23/0.40 thf(f84,plain,(
% 0.23/0.40 ((((sK1 @ sK5) & (sK2 @ sK5)) & ((sK0 @ sK5) = sK4)) = $true)),
% 0.23/0.40 inference(beta_eta_normalization,[],[f83])).
% 0.23/0.40 thf(f83,plain,(
% 0.23/0.40 (((^[Y0 : $i]: (((sK1 @ Y0) & (sK2 @ Y0)) & ((sK0 @ Y0) = sK4))) @ sK5) = $true)),
% 0.23/0.40 inference(sigma_clausification,[],[f82])).
% 0.23/0.40 thf(f82,plain,(
% 0.23/0.40 ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) & (sK2 @ Y0)) & ((sK0 @ Y0) = sK4)))) = $true)),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f80])).
% 0.23/0.40 thf(f80,plain,(
% 0.23/0.40 ($false = ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) & (sK2 @ Y0)) & ((sK0 @ Y0) = sK4)))) => ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) & (?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4)))))))),
% 0.23/0.40 inference(beta_eta_normalization,[],[f79])).
% 0.23/0.40 thf(f79,plain,(
% 0.23/0.40 ($false = ((^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) & (sK2 @ Y1)) & ((sK0 @ Y1) = Y0)))) => ((?? @ $i @ (^[Y1 : $i]: ((sK1 @ Y1) & ((sK0 @ Y1) = Y0)))) & (?? @ $i @ (^[Y1 : $i]: ((sK2 @ Y1) & ((sK0 @ Y1) = Y0))))))) @ sK4))),
% 0.23/0.40 inference(sigma_clausification,[],[f78])).
% 0.23/0.40 thf(f78,plain,(
% 0.23/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) & (sK2 @ Y1)) & ((sK0 @ Y1) = Y0)))) => ((?? @ $i @ (^[Y1 : $i]: ((sK1 @ Y1) & ((sK0 @ Y1) = Y0)))) & (?? @ $i @ (^[Y1 : $i]: ((sK2 @ Y1) & ((sK0 @ Y1) = Y0)))))))))),
% 0.23/0.40 inference(beta_eta_normalization,[],[f77])).
% 0.23/0.40 thf(f77,plain,(
% 0.23/0.40 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))) @ sK0 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))) @ sK1 @ sK2)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))) @ sK0 @ sK1) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))) @ sK0 @ sK2))) != $true)),
% 0.23/0.40 inference(definition_unfolding,[],[f75,f76,f74,f72,f72,f74,f74])).
% 0.23/0.40 thf(f72,plain,(
% 0.23/0.40 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))))),
% 0.23/0.40 inference(cnf_transformation,[],[f29])).
% 0.23/0.40 thf(f29,plain,(
% 0.23/0.40 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))))),
% 0.23/0.40 inference(fool_elimination,[],[f28])).
% 0.23/0.40 thf(f28,plain,(
% 0.23/0.40 (intersection = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) & (X0 @ X2))))),
% 0.23/0.40 inference(rectify,[],[f8])).
% 0.23/0.40 thf(f8,axiom,(
% 0.23/0.40 (intersection = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X2 @ X3) & (X0 @ X3))))),
% 0.23/0.40 file('/export/starexec/sandbox2/tmp/tmp.x2H349LPZo/Vampire---4.8_26174',intersection)).
% 0.23/0.40 thf(f74,plain,(
% 0.23/0.40 (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))))),
% 0.23/0.40 inference(cnf_transformation,[],[f43])).
% 0.23/0.40 thf(f43,plain,(
% 0.23/0.40 (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))))),
% 0.23/0.40 inference(fool_elimination,[],[f42])).
% 0.23/0.40 thf(f42,plain,(
% 0.23/0.40 (fun_image = (^[X0 : $i > $i, X1 : $i > $o, X2 : $i] : (? [X3] : (((X0 @ X3) = X2) & (X1 @ X3)))))),
% 0.23/0.40 inference(rectify,[],[f15])).
% 0.23/0.40 thf(f15,axiom,(
% 0.23/0.40 (fun_image = (^[X4 : $i > $i, X5 : $i > $o, X2 : $i] : (? [X0] : (((X4 @ X0) = X2) & (X5 @ X0)))))),
% 0.23/0.40 file('/export/starexec/sandbox2/tmp/tmp.x2H349LPZo/Vampire---4.8_26174',fun_image)).
% 0.23/0.40 thf(f76,plain,(
% 0.23/0.40 (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.23/0.40 inference(cnf_transformation,[],[f60])).
% 0.23/0.40 thf(f60,plain,(
% 0.23/0.40 (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.23/0.40 inference(fool_elimination,[],[f59])).
% 0.23/0.40 thf(f59,plain,(
% 0.23/0.40 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((X0 @ X2) => (X1 @ X2)))) = subset)),
% 0.23/0.40 inference(rectify,[],[f12])).
% 0.23/0.40 thf(f12,axiom,(
% 0.23/0.40 ((^[X0 : $i > $o, X2 : $i > $o] : (! [X3] : ((X0 @ X3) => (X2 @ X3)))) = subset)),
% 0.23/0.40 file('/export/starexec/sandbox2/tmp/tmp.x2H349LPZo/Vampire---4.8_26174',subset)).
% 0.23/0.40 thf(f75,plain,(
% 0.23/0.40 ($true != (subset @ (fun_image @ sK0 @ (intersection @ sK1 @ sK2)) @ (intersection @ (fun_image @ sK0 @ sK1) @ (fun_image @ sK0 @ sK2))))),
% 0.23/0.40 inference(cnf_transformation,[],[f71])).
% 0.23/0.40 thf(f71,plain,(
% 0.23/0.40 ($true != (subset @ (fun_image @ sK0 @ (intersection @ sK1 @ sK2)) @ (intersection @ (fun_image @ sK0 @ sK1) @ (fun_image @ sK0 @ sK2))))),
% 0.23/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f69,f70])).
% 0.23/0.40 thf(f70,plain,(
% 0.23/0.40 ? [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : ((subset @ (fun_image @ X0 @ (intersection @ X1 @ X2)) @ (intersection @ (fun_image @ X0 @ X1) @ (fun_image @ X0 @ X2))) != $true) => ($true != (subset @ (fun_image @ sK0 @ (intersection @ sK1 @ sK2)) @ (intersection @ (fun_image @ sK0 @ sK1) @ (fun_image @ sK0 @ sK2))))),
% 0.23/0.40 introduced(choice_axiom,[])).
% 0.23/0.40 thf(f69,plain,(
% 0.23/0.40 ? [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : ((subset @ (fun_image @ X0 @ (intersection @ X1 @ X2)) @ (intersection @ (fun_image @ X0 @ X1) @ (fun_image @ X0 @ X2))) != $true)),
% 0.23/0.40 inference(ennf_transformation,[],[f68])).
% 0.23/0.40 thf(f68,plain,(
% 0.23/0.40 ~! [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : ((subset @ (fun_image @ X0 @ (intersection @ X1 @ X2)) @ (intersection @ (fun_image @ X0 @ X1) @ (fun_image @ X0 @ X2))) = $true)),
% 0.23/0.40 inference(fool_elimination,[],[f67])).
% 0.23/0.40 thf(f67,plain,(
% 0.23/0.40 ~! [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : (subset @ (fun_image @ X0 @ (intersection @ X1 @ X2)) @ (intersection @ (fun_image @ X0 @ X1) @ (fun_image @ X0 @ X2)))),
% 0.23/0.40 inference(rectify,[],[f24])).
% 0.23/0.40 thf(f24,negated_conjecture,(
% 0.23/0.40 ~! [X4 : $i > $i,X0 : $i > $o,X2 : $i > $o] : (subset @ (fun_image @ X4 @ (intersection @ X0 @ X2)) @ (intersection @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
% 0.23/0.40 inference(negated_conjecture,[],[f23])).
% 0.23/0.40 thf(f23,conjecture,(
% 0.23/0.40 ! [X4 : $i > $i,X0 : $i > $o,X2 : $i > $o] : (subset @ (fun_image @ X4 @ (intersection @ X0 @ X2)) @ (intersection @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
% 0.23/0.40 file('/export/starexec/sandbox2/tmp/tmp.x2H349LPZo/Vampire---4.8_26174',thm)).
% 0.23/0.40 thf(f116,plain,(
% 0.23/0.40 (sK4 != (sK0 @ sK5)) | ~spl3_1),
% 0.23/0.40 inference(trivial_inequality_removal,[],[f114])).
% 0.23/0.40 thf(f114,plain,(
% 0.23/0.40 ($false = $true) | (sK4 != (sK0 @ sK5)) | ~spl3_1),
% 0.23/0.40 inference(superposition,[],[f101,f87])).
% 0.23/0.40 thf(f87,plain,(
% 0.23/0.40 ((sK2 @ sK5) = $true)),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f86])).
% 0.23/0.40 thf(f86,plain,(
% 0.23/0.40 (((sK1 @ sK5) & (sK2 @ sK5)) = $true)),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f84])).
% 0.23/0.40 thf(f101,plain,(
% 0.23/0.40 ( ! [X1 : $i] : (((sK2 @ X1) = $false) | (sK4 != (sK0 @ X1))) ) | ~spl3_1),
% 0.23/0.40 inference(avatar_component_clause,[],[f100])).
% 0.23/0.40 thf(f100,plain,(
% 0.23/0.40 spl3_1 <=> ! [X1] : ((sK4 != (sK0 @ X1)) | ((sK2 @ X1) = $false))),
% 0.23/0.40 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.23/0.40 thf(f113,plain,(
% 0.23/0.40 ~spl3_2),
% 0.23/0.40 inference(avatar_contradiction_clause,[],[f112])).
% 0.23/0.40 thf(f112,plain,(
% 0.23/0.40 $false | ~spl3_2),
% 0.23/0.40 inference(subsumption_resolution,[],[f108,f89])).
% 0.23/0.40 thf(f108,plain,(
% 0.23/0.40 (sK4 != (sK0 @ sK5)) | ~spl3_2),
% 0.23/0.40 inference(trivial_inequality_removal,[],[f106])).
% 0.23/0.40 thf(f106,plain,(
% 0.23/0.40 ($false = $true) | (sK4 != (sK0 @ sK5)) | ~spl3_2),
% 0.23/0.40 inference(superposition,[],[f88,f104])).
% 0.23/0.40 thf(f104,plain,(
% 0.23/0.40 ( ! [X2 : $i] : (((sK1 @ X2) = $false) | (sK4 != (sK0 @ X2))) ) | ~spl3_2),
% 0.23/0.40 inference(avatar_component_clause,[],[f103])).
% 0.23/0.40 thf(f103,plain,(
% 0.23/0.40 spl3_2 <=> ! [X2] : (((sK1 @ X2) = $false) | (sK4 != (sK0 @ X2)))),
% 0.23/0.40 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.23/0.40 thf(f88,plain,(
% 0.23/0.40 ((sK1 @ sK5) = $true)),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f86])).
% 0.23/0.40 thf(f105,plain,(
% 0.23/0.40 spl3_1 | spl3_2),
% 0.23/0.40 inference(avatar_split_clause,[],[f98,f103,f100])).
% 0.23/0.40 thf(f98,plain,(
% 0.23/0.40 ( ! [X2 : $i,X1 : $i] : ((sK4 != (sK0 @ X1)) | ((sK1 @ X2) = $false) | ((sK2 @ X1) = $false) | (sK4 != (sK0 @ X2))) )),
% 0.23/0.40 inference(equality_proxy_clausification,[],[f97])).
% 0.23/0.40 thf(f97,plain,(
% 0.23/0.40 ( ! [X2 : $i,X1 : $i] : (((sK1 @ X2) = $false) | ((sK2 @ X1) = $false) | (sK4 != (sK0 @ X1)) | (((sK0 @ X2) = sK4) = $false)) )),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f96])).
% 0.23/0.40 thf(f96,plain,(
% 0.23/0.40 ( ! [X2 : $i,X1 : $i] : (((sK2 @ X1) = $false) | (((sK1 @ X2) & ((sK0 @ X2) = sK4)) = $false) | (sK4 != (sK0 @ X1))) )),
% 0.23/0.40 inference(equality_proxy_clausification,[],[f95])).
% 0.23/0.40 thf(f95,plain,(
% 0.23/0.40 ( ! [X2 : $i,X1 : $i] : (((sK2 @ X1) = $false) | ($false = ((sK0 @ X1) = sK4)) | (((sK1 @ X2) & ((sK0 @ X2) = sK4)) = $false)) )),
% 0.23/0.40 inference(beta_eta_normalization,[],[f94])).
% 0.23/0.40 thf(f94,plain,(
% 0.23/0.40 ( ! [X2 : $i,X1 : $i] : (((sK2 @ X1) = $false) | (((^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4))) @ X2) = $false) | ($false = ((sK0 @ X1) = sK4))) )),
% 0.23/0.40 inference(pi_clausification,[],[f93])).
% 0.23/0.40 thf(f93,plain,(
% 0.23/0.40 ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false) | ((sK2 @ X1) = $false) | ($false = ((sK0 @ X1) = sK4))) )),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f92])).
% 0.23/0.40 thf(f92,plain,(
% 0.23/0.40 ( ! [X1 : $i] : (($false = ((sK2 @ X1) & ((sK0 @ X1) = sK4))) | ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false)) )),
% 0.23/0.40 inference(beta_eta_normalization,[],[f91])).
% 0.23/0.40 thf(f91,plain,(
% 0.23/0.40 ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false) | ($false = ((^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4))) @ X1))) )),
% 0.23/0.40 inference(pi_clausification,[],[f90])).
% 0.23/0.40 thf(f90,plain,(
% 0.23/0.40 ((?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false) | ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false)),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f81])).
% 0.23/0.40 thf(f81,plain,(
% 0.23/0.40 ($false = ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) & (?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4))))))),
% 0.23/0.40 inference(binary_proxy_clausification,[],[f80])).
% 0.23/0.40 % SZS output end Proof for Vampire---4
% 0.23/0.40 % (26287)------------------------------
% 0.23/0.40 % (26287)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (26287)Termination reason: Refutation
% 0.23/0.40
% 0.23/0.40 % (26287)Memory used [KB]: 5628
% 0.23/0.40 % (26287)Time elapsed: 0.008 s
% 0.23/0.40 % (26287)Instructions burned: 7 (million)
% 0.23/0.40 % (26287)------------------------------
% 0.23/0.40 % (26287)------------------------------
% 0.23/0.40 % (26281)Success in time 0.019 s
% 0.23/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------